skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Peres, Yuval"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, IEEE Transactions on Automatic Control)
    Full Text Available 
  2. ; ; ; (, IEEE Transactions on Information Theory)
    Full Text Available 
  3. ; ; (, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques)
    null (Ed.)
    Full Text Available 
  4. ; ; ; (, Proceedings of the National Academy of Sciences)
    Motivated by applications in wireless networks and the Internet of Things, we consider a model of n nodes trying to reach consensus with high probability on their majority bit. Each node i is assigned a bit at time 0 and is a finite automaton with m bits of memory (i.e., 2 m states) and a Poisson clock. When the clock of i rings, i can choose to communicate and is then matched to a uniformly chosen node j. The nodes j and i may update their states based on the state of the other node. Previous work has focused on minimizing the time to consensus and the probability of error, while our goal is minimizing the number of communications. We show that, when m > 3 ⁡ log ⁡ log ⁡ log ( n ) , consensus can be reached with linear communication cost, but this is impossible if m < log ⁡ log ⁡ log ( n ) . A key step is to distinguish when nodes can become aware of knowing the majority bit and stop communicating. We show that this is impossible if their memory is too low. 
    more » « less
  5. ; ; ; (, 2018 IEEE Conference on Decision and Control (CDC))
    Full Text Available